Optimal Computation of the Contour of Maximal Elements on Mesh-Connected Computers

Dehne presented an optimal algorithm to compute the contour of the maximal elements of n planar points on a pn pn mesh. We have calculated that Dehne’s algorithm requires 23pn steps and we have been able to reduce the required steps to 19pn through pre-sorting and using an efficient strategy in dividing the mesh into halves. It has also been established that any implementation of Dehne’s algorithm requires at least 15pn steps. We have further developed a new optimal algorithm which requires at most 10pn steps.